A population heuristic for constrained two-dimensional non-guillotine cutting
نویسنده
چکیده
منابع مشابه
Iterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملA simple approach to the two-dimensional guillotine cutting stock problem
Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a new, practical, rapid, and heuristic method was proposed for such problems. Then, the ...
متن کاملA Hybrid Heuristic for the Constrained Two-dimensional Non-guillotine Orthogonal Cutting Problem
This paper addresses a constrained two-dimensional (2D) non-guillotine cutting problem, where a fixed set of small rectangles has to be cut from a larger stock rectangle so as to maximize the value of the rectangles cut. The algorithm we propose hybridizes a novel placement procedure with a genetic algorithm based on random keys. We propose also a new fitness function to drive the optimization....
متن کاملApplying Backtracking Heuristics for Constrained Two-Dimensional Guillotine Cutting Problems
The Backtracking Heuristic (BH) methodology consists in to construct of items by combination between heuristics that solve mathematical programming models, and backtrack search algorithm to figure out the best heuristics and their best ordering. BH was firstly introduced in the literature in order to solve three-dimensional Knapsack Loading Problems, showing promising results. In this present w...
متن کاملA Genetic Algorithm for the Two-dimensional Single Large Object Placement Problem
The two-dimensional Single Large Object Placement Problem (SLOPP) problem consists of determining a cutting pattern of a set of n small rectangular piece types (little object) on a rectangular stock plate (large object) of length L and width W, as to maximize the sum of the profits of the pieces to be cut. Each piece type i, i = 1, . . ., m, is characterized by a length li, a width wi, a profit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 156 شماره
صفحات -
تاریخ انتشار 2004